#include<bits/stdc++.h>
using namespace std;

typedef long long llong;
const int N=1e5+3;

int n,ans;
int a[N];
bool out[N];

int find(int l,int r,int k){
    int ans=-1;
    while(l<=r){
        int mid=(l+r)>>1;
        if(a[mid]<k){
            ans=mid;
            l=mid+1;
        }
        else
            r=mid-1;
    }
    return ans;
}

int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    ios::sync_with_stdio(0);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+n+1);
    int p=n;
    for(int i=n;i;i--){
        if(!out[i]) ans++;
        p=min(p,i-1);
        int f=find(1,p,a[i]);
        if(f!=-1){
            out[f]=1;
            p=f-1;
        }
    }
    cout<<ans<<endl;
    return 0;
}